Universal decoding for memoryless Gaussian channels with a deterministic interference

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal decoding for memoryless Gaussian channels with a deterministic interference

A universal decoding procedure is proposed for memoryless Gaussian channels with deterministic interfering signals from a certain class. The universality of the proposed decoder is in the sense of W i g independent of the channel parameters and the unknown interfering signal, and at the same time attaining the same random coding e m r exponent as the optimal maximum likelihood (ML) decoder, whi...

متن کامل

Universal Decoding for Channels with Memory

A universal decoder for a parametric family of channels is a decoder whose structure depends on the family but not on the individual channel over which transmission takes place, and it yet attains the same random-coding error exponent as the maximum-likelihood receiver tuned to the channel in use. The existence and structure of such decoders is demonstrated under relatively mild conditions of c...

متن کامل

Universal Decoding for Noisy Channels

A universal decoder for a parametric family of channels is a decoder that for any channel in the family attains the same random coding error exponent as the best decoder for that particular channel. The existence and structure of such decoders is demonstrated under relatively mild conditions of continuity of the channel law with respect to the parameter indexing the family. It is further shown ...

متن کامل

On Gaussian Interference Channels with mixed interference

This work analyzes a particular achievable region for Gaussian interference channels (IFC) derived from the general Han-Kobayashi region. By reformulating the Han-Kobayashi achievable region as the sum of two sets, we characterize the maximum achievable sum-rate with Gaussian inputs and without timesharing in closed from for any Gaussian IFC. We then show that the computed sum-rate meets the up...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 1993

ISSN: 0018-9448

DOI: 10.1109/18.243443